Best approximation of coincidence points in metric trees
نویسندگان
چکیده
منابع مشابه
Best approximation of coincidence points in metric trees
In this work we present results on fixed points, pairs of coincidence points and best approximation for ε-semicontinuous mappings in metric trees. It is a generalization of the similar properties of upper and almost lower semicontinuous mappings.
متن کاملOptimal coincidence best approximation solution in non-Archimedean Fuzzy Metric Spaces
In this paper, we introduce the concept of best proximal contraction theorems in non-Archimedean fuzzy metric space for two mappings and prove some proximal theorems. As a consequence, it provides the existence of an optimal approximate solution to some equations which contains no solution. The obtained results extend further the recently development proximal contractions in non-Archimedean fuz...
متن کاملCoincidence Quasi-Best Proximity Points for Quasi-Cyclic-Noncyclic Mappings in Convex Metric Spaces
We introduce the notion of quasi-cyclic-noncyclic pair and its relevant new notion of coincidence quasi-best proximity points in a convex metric space. In this way we generalize the notion of coincidence-best proximity point already introduced by M. Gabeleh et al cite{Gabeleh}. It turns out that under some circumstances this new class of mappings contains the class of cyclic-noncyclic mappings ...
متن کاملFixed Points and Best Approximation in Menger Convex Metric Spaces
Nonexpansive mappings have been studied extensively in recent years by many authors.The first fixed point theorem of a general nature for nonlinear nonexpansive mappings in noncompact setting were proved independently by Browder [8] and Gohde [12]. Later on, Kirk [17] proved the same results under slightly weaker assumptions. A fundamental problem in fixed point theory of nonexpansive mappings ...
متن کاملOn Best Proximity Points in metric and Banach spaces
Notice that best proximity point results have been studied to find necessaryconditions such that the minimization problemminx∈A∪Bd(x,Tx)has at least one solution, where T is a cyclic mapping defined on A∪B.A point p ∈ A∪B is a best proximity point for T if and only if thatis a solution of the minimization problem (2.1). Let (A,B) be a nonemptypair in a normed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales UMCS, Mathematica
سال: 2008
ISSN: 0365-1029
DOI: 10.2478/v10062-008-0013-3